Analytical Dynamic Programming Matching
نویسندگان
چکیده
In this paper, we show that the truly two-dimensional elastic image matching problem can be solved analytically using dynamic programming (DP) in polynomial time if the problem is formulated as a maximum a posteriori problem using Gaussian distributions for the likelihood and prior. After giving the derivation of the analytical DP matching algorithm, we evaluate its performance on handwritten character images containing various nonlinear deformations, and compare other elastic image matching methods.
منابع مشابه
Analytical Matching of Optimal Damping Characteristics Curve for Vehicle Passive Suspensions
To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...
متن کاملDynamic programming matching for large scale information retrieval
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for large-scale information retrieval. In this paper, we propose a method of dynamic programming matching for information retrieval. This method is as effective as a conventional information retriev...
متن کاملSemantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartit...
متن کاملAn Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments is built. Establishing correspondence is then reduced to a problem of searching for the optimal path that maximizes a similarity measure. The optimal path is found efficiently without the adverse effects of combinatori...
متن کاملDynamic matchings and quasidynamic fractional matchings. I
This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time-expanded infinite network. The initial model is a finite directed graph G = (V, E) in which each edge has an associated real-valued weight and an integral distance. We wish to "match" vertices over an infinite horizon, and we permit vertex i in period...
متن کامل